Welcome![Sign In][Sign Up]
Location:
Search - graph in c program

Search list

[Other resourcespan_forest

Description: Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, \"g++ -o span_forest span_forest.c\". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.
Platform: | Size: 3545 | Author: 卢松 | Hits:

[Graph program3dgpl

Description: 一个用于gpl游戏编程的3d图形处理库- The 3d graph processing storehouse which uses in the gpl game to program
Platform: | Size: 94208 | Author: 站长 | Hits:

[Windows DevelopGdemo2

Description: 1、 介绍计算机动画的基本知识和实现方法 2、 在VC++中建立时钟消息,使用时钟消息产生动画。 3、 介绍动态地获取图形文件名。 4、 介绍在VC++中窗口、控件大小控制和定位的方法。 5、 程序运行时的目录定位方法。-Demos of graph animation program in windows.
Platform: | Size: 1242112 | Author: | Hits:

[Data structsspan_forest

Description: Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.
Platform: | Size: 3072 | Author: 卢松 | Hits:

[Data structsMindistance

Description: 对于无向图或有向图,程序可以计算出图中每两个顶点之间的最短路径,并列出Floyd算法的具体实现-For undirected graph or directed graph, the program can calculate a figure between every two vertices of the shortest path, and lists the specific realize Floyd algorithm
Platform: | Size: 192512 | Author: 王海涛 | Hits:

[Data structsc++

Description: 程序设计当中经常会出现使用同种数据结构的不同实例的情况。例如:在一个程序中 可以使用多个队列、树、图等结构来组织数据。同种结构的不同实例,也许只在数据元素 的类型或数量上略有差异,如果对每个实例都重新定义,则非常麻烦且容易出错。那么能 否对同种类型数据结构仅定义一次呢?答案是肯定的,C++提供的类模板(Class Template )就可以实现该功能。 -Program design which often use the same kinds of data structures of different examples of the situation. For example: in one program can use multiple queues, trees, graph structure to organize data. Structure with different kinds of examples, perhaps only in the data elements of the type or number of slightly different, if each instance of re-definition, is very cumbersome and error-prone. So whether on the same data structure types defined only once? The answer is yes, C++ Provided class template (Class Template) can realize the feature.
Platform: | Size: 8192 | Author: axax123 | Hits:

[ConsolecDAGlab6

Description: 自己写的一个图的转换CMD 程序 nodag.txt是一个有环图演示输入文件. dag.txt是一个无环图演示输入文件. g.c 为主程序文件 stackar.c 为堆栈定义和调用文件 run.exe 为已编译好的可执行文件 我编写了一个MAKEFILE文件.如果不使用MAKEFILE 请在g.c文件的头部添加 #include "stackar.c" 然后再直接编译g.c. 使用了堆栈的演示代码.-Their own plans to write a conversion CMD process has nodag.txt is a DAG input file presentation. Dag.txt acyclic graph is a demonstration of the input file. Gc main program file stackar.c for the definition and call the document stack run.exe have compiled executable file, I prepared a Makefile file. If you do not use the Makefile file in the head gc add# include stackar.c and then direct the compiler uses the stack gc demo code.
Platform: | Size: 13312 | Author: gaoquan | Hits:

[ELanguageredundantpaths

Description: c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
Platform: | Size: 2048 | Author: jazz | Hits:

[Windows DevelopProgetto

Description: c program to calcolate the number of triangles in a graph
Platform: | Size: 78848 | Author: rocco87 | Hits:

[Other22

Description: 这是我平时做的一次作业,是用C++编写的一个程序,是关于图的遍历,实现对图的广度和深度遍历-This is what I usually do a job, is written in C++, a program on the graph traversal to realize the breadth and depth of the graph traversal
Platform: | Size: 29696 | Author: 潇潇 | Hits:

[VC/MFCgraf

Description: This a program in C++. This program is about graph-This is a program in C++. This program is about graph
Platform: | Size: 1024 | Author: Andrzej | Hits:

[EditorOLEAuto

Description: MS Office Automation using C++” - this what I started searching over the internet a few weeks back to plot a graph in an Excel sheet through my program. Fortunately, I got a few - actually very few - inputs from the cyber world, might be because I am a poor searcher in the internet. This article is for those who are still searching the internet with the same keywords.-MS Office Automation using C++”- this is what I started searching over the internet a few weeks back to plot a graph in an Excel sheet through my program. Fortunately, I got a few- actually very few- inputs from the cyber world, might be because I am a poor searcher in the internet. This article is for those who are still searching the internet with the same keywords.
Platform: | Size: 38912 | Author: mxw | Hits:

[Data structsGraph

Description: 程序采用C++编写,在C++Builder6.0中编译通过,用于计算简单图结构的连通度和结合度。-Using C++ program written in C++ Builder6.0 in compiles, used to calculate the simple graph structure, degree of connectivity and integration.
Platform: | Size: 79872 | Author: 孔翔翔 | Hits:

[assembly languageC

Description: 主要介绍线性结构,树型结构,图状结构三种逻辑结构元素的存储实现,在此基础上介绍一些典型算法及时,空效率分析.-Introduces the linear structure, tree structure, graph-like structure of three elements of the logical structure of the storage to achieve, on this basis are some typical algorithms in time, space efficiency analysis. The main task of this course is to train students algorithm design capability and good programming habits. Through the study, requiring students to master the classic algorithm design and program implementation, to select the appropriate question based on the actual design of a compact storage, efficient and practical algorithm for the following courses of study and lay a good foundation for software development.
Platform: | Size: 370688 | Author: pan | Hits:

[Graph Drawinginterfacetograph

Description: It s interface to graph in C++ Builder 6. It s very easy program with easy implementation, non class and heavy function. You try it.
Platform: | Size: 25600 | Author: dupek | Hits:

[matlabCODE

Description: 1.GeometricContext文件是完成图片中几何方向目标分类。 参考文献《Automatic Photo Pop-up》Hoiem 2005 2 GrabCut文件是完成图像中目标交互式分割 参考文献《“GrabCut” — Interactive Foreground Extraction using Iterated Graph Cuts》 C. Rother 2004 3 HOG文件是自己编写的根据HOG特征检测行人的matlab代码 4 虹膜识别程序是下载的一个通用的虹膜识别程序,可以运行 5 GML_AdaBoost_Matlab_Toolbox是一个很好用的adaboost matlab工具箱 6 libsvm-mat-2.91-1 是用C编写的改进的SVM程序,代码质量很高,提供了matlab接口 7 SIFT_Matlab 是编写的利用sift特征进行的宽基线匹配,代码质量高 8 FLDfisher 是利用fisher 线性降维方法进行人脸识别-1.GeometricContext file is complete the picture in the geometric direction of target classification. References " Automatic Photo Pop-up" Hoiem 2005 2 GrabCut the target file is an interactive segmentation of image reference " " GrabCut " - Interactive Foreground Extraction using Iterated Graph Cuts" C. Rother 2004 3 HOG documents prepared under their own HOG Characteristics of pedestrian detection matlab code 4 iris recognition process is to download a general iris recognition program, you can run 5 GML_AdaBoost_Matlab_Toolbox is a good use of adaboost matlab toolbox 6 libsvm-mat-2.91-1 is written in C to improve the SVM procedures, code of high quality, provides a matlab interface to 7 SIFT_Matlab is prepared for the use of sift features a wide baseline matching, the code is the use of high quality 8 FLDfisher fisher linear dimension reduction method for face recognition
Platform: | Size: 6918144 | Author: 张数 | Hits:

[Data structsusing-adjacent-matrix-to-store-graph

Description: 用C语言数据结构描述的演示用邻接矩阵存图的小程序-Described in C language data structures stored adjacency matrix of graph presentation with a small program
Platform: | Size: 1024 | Author: pustar | Hits:

[Graph Drawingdraw-program

Description: 用C#写的绘图程序,可以实现画、读取、存储点线面。并对图形进行缩放、拉伸、平移等操作。更重要的是,实现了图形的橡皮绘制效果!-Written in c# drawing program, can realize the painting, read the save point, line and plane. And the graph, stretching, such as the translation of the scale operation. More important, realize the graphic rubber rendering effects!
Platform: | Size: 1418240 | Author: 张海兵 | Hits:

[2D Graphicgraph

Description: C#编写,实现windows画图程序的所有功能,并且有撤销功能(支持50次),此外还可能对图形进行旋转、缩放、平移、裁剪。曲线为Bezier曲线-All functions written in C#, windows Paint program, and the Undo function (support 50) In addition, the graphics may rotate, zoom, pan, cutting. Curve for Bezier curves
Platform: | Size: 626688 | Author: | Hits:

[Special Effectsthe shortest path program in graph theory

Description: 图论算法在计算机科学中扮演着很重要的角色,它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题,然后用图论的基本算法加以解决。遗传算法是解优化问题的有效算法,而并行遗传算法是遗传算法研究中的一个重要方向,受到了研究人员的高度重视。(Graph theory plays an important role in computer science. It provides a simple and systematic modeling method for many problems. Many problems can be translated into graph theory problems, and then solved by the basic algorithm of graph theory. Genetic algorithm is an efficient algorithm for solving optimization problems, and parallel genetic algorithm is an important direction of genetic algorithm research, and has attracted much attention of researchers.)
Platform: | Size: 27648 | Author: 四姑娘 | Hits:
« 12 3 »

CodeBus www.codebus.net